REVERSIBLE DATA HIDING BASED ON PIXEL-BASED PIXEL VALUE ORDERING PREDICTOR AND EMD

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Reversible Data Hiding Based on Geometric Structure of Pixel Groups

Many reversible data hiding schemes have been developed in recent decades. Traditional schemes typically must deal with the problem of overflow and underflow, or transmission of hiding parameters. The new reversible data hiding scheme proposed in this paper is based on a combination of pixel groups’ geometric structure and secret sharing mechanism. Experimental results confirm that the proposed...

متن کامل

Data Hiding Method Based on Graph Coloring and Pixel Block‘s Correlation in Color Image

An optimized method for data hiding into a digital color image in spatial domainis provided. The graph coloring theory with different color numbers is applied. To enhance thesecurity of this method, block correlations method in an image is used. Experimental results showthat with the same PSNR, the capacity is improved by %8, and also security has increased in themethod compared with other meth...

متن کامل

Dual-Image Based Reversible Data Hiding Scheme Using Pixel Value Difference Expansion

In this paper, we propose a dual-image based reversible data hiding scheme. Here, we divide a secret message into sub-stream of size n bits, where n − 1 bits are embedded using Pixel Value Differencing (PVD) and 1 bit is embedded using Difference Expansion (DE). We consider two consecutive pixels from cover image, calculate the difference between them and then embed n − 1 bits secret message by...

متن کامل

An Information Hiding Scheme Based on Pixel-Value-Ordering and Prediction-Error Expansion with Reversibility

This paper proposes a data hiding scheme based on pixel-value-ordering and predication-error expansion. In a natural image, most neighboring pixels have similar pixel values, i.e. the difference between neighboring pixels is small. Based on the observation, we may predict a pixel’s value according its neighboring pixels. The proposed scheme divides an image into non-overlapping blocks each of w...

متن کامل

Hierarchical Context-based Pixel Ordering

We present a context-based scanning algorithm which reorders the input image using a hierarchical representation of the image. Our algorithm optimally orders (permutes) the leaves corresponding to the pixels, by minimizing the sum of distances between neighboring pixels. The reordering results in an improved autocorrelation between nearby pixels which leads to a smoother image. This allows us, ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Scientific Journal of Tra Vinh University

سال: 2019

ISSN: 1859-4816

DOI: 10.35382/18594816.1.1.2019.82